Erc Sets and Antimatroids
نویسنده
چکیده
Grammars in Optimality Theory can be characterized by sets of Ercs (Elementary Ranking Conditions). Antimatroids are structures that arose initially in the study of lattices. In this paper we prove that antimatroids and consistent Erc sets have the same formal structures. We do so by defining two functions MChain and RCerc, MChain being a function from consistent sets of Ercs to antimatroids and RCerc a function from antimatroids to Erc sets. We then show that these functions are inverses of each other and that both maintain the structural properties of Erc sets and antimatroids. This establishes that antimatroids and consistent Erc sets have the same formal structure, allowing linguists to import from the sizable work done on antimatroids any and all results.
منابع مشابه
On the shelling antimatroids of split graphs
Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids. Here we consider a special case of these antimatroids, namely the split graph shelling antimatroids. We show that the feasible sets of such an antimatroid relate to some poset shelling antimatr...
متن کاملGeometry of antimatroidal point sets
The notion of ”antimatroid with repetition” was conceived by Bjorner, Lovasz and Shor in 1991 as a multiset extension of the notion of antimatroid [2]. When the underlying set consists of only two elements, such two-dimensional antimatroids correspond to point sets in the plane. In this research we concentrate on geometrical properties of antimatroidal point sets in the plane and prove that the...
متن کاملCorrespondence between two Antimatroid Algorithmic Characterizations
The basic distinction between already known algorithmic characterizations of matroids and antimatroids is in the fact that for antimatroids the ordering of elements is of great importance. While antimatroids can also be characterized as set systems, the question whether there is an algorithmic description of antimatroids in terms of sets and set functions was open for some period of time. This ...
متن کاملGray Codes from Antimatroids
We show three main results concerning Hamiltonicity of graphs derived from antimatroids. These results provide Gray codes for the feasible sets and basic words of antimatroids. For antimatroid (E; F), let J (F) denote the graph whose vertices are the sets of F, where two vertices are adjacent if the corresponding sets diier by one element. Deene J (F; k) to be the subgraph of J (F) 2 induced by...
متن کاملAn algorithmic characterization of antimatroids
In an article entitled “Optimal sequencing of a single machine subject to precedence constraints” E.L. Lawler presented a now classical minmax result for job scheduling. In essence, Lawler’s proof demonstrated that the properties of partially ordered sets were sufficient to solve the posed scheduling problem. These properties are, in fact, common to a more general class of combinatorial structu...
متن کامل